package com.cb2.algorithm.leetcode;

/**
 * <a href='https://leetcode.cn/problems/shuffle-the-array'>重新排列数组(Shuffle the Array)</a>
 * <p>给你一个数组 nums ，数组中有 2n 个元素，按 [x1,x2,...,xn,y1,y2,...,yn] 的格式排列。</p>
 * <p>请你将数组按 [x1,y1,x2,y2,...,xn,yn] 格式重新排列，返回重排后的数组。</p>
 *
 * <p>
 * <b>示例：</b>
 * <pre>
 *  示例 1：
 *
 *      输入：nums = [2,5,1,3,4,7], n = 3
 *      输出：[2,3,5,4,1,7]
 *      解释：由于 x1=2, x2=5, x3=1, y1=3, y2=4, y3=7 ，所以答案为 [2,3,5,4,1,7]
 *
 * 示例 2：
 *      输入：nums = [1,2,3,4,4,3,2,1], n = 4
 *      输出：[1,4,2,3,3,2,4,1]
 *
 * 示例 3：
 *      输入：nums = [1,1,2,2], n = 2
 *      输出：[1,2,1,2]
 * </pre>
 * </p>
 *
 * <p>
 * <b>提示：</b>
 * <ul>
 *     <li>1 <= n <= 500</li>
 *     <li>nums.length == 2n</li>
 *     <li>1 <= nums[i] <= 10^3</li>
 * </ul>
 * </p>
 *
 * @author c2b
 * @since 2025/4/28 14:07
 */
public class LC1470ShuffleTheArray_S {
    static class Solution {
        public int[] shuffle(int[] nums, int n) {
            int[] res = new int[nums.length];
            for (int i = 0; i < n; i++) {
                res[2 * i] = nums[i];
                res[2 * i + 1] = nums[i + n];
            }
            return res;
        }
    }

    public static void main(String[] args) {
        Solution solution = new Solution();
        Printer.printArrayInt(solution.shuffle(new int[]{2, 5, 1, 3, 4, 7}, 3));
        Printer.printArrayInt(solution.shuffle(new int[]{1, 2, 3, 4, 4, 3, 2, 1}, 4));
        Printer.printArrayInt(solution.shuffle(new int[]{1, 1, 2, 2}, 2));
    }
}
